Proof planning for maintainable configuration systems

نویسندگان

  • Helen Lowe
  • Michal Pechoucek
  • Alan Bundy
چکیده

Configuration is a complex task generally involving varying measures of constraint satisfaction, optimization, and the management of soft constraints. Although many successful systems have been developed, these are often difficult to maintain and to generalize in rapidly changing domains. In this paper we consider building intelligent knowledge based systems with maintainability well to the fore in our requirements for such systems. We introduce two case studies: the initial proof of concept, which was in the domain of computer configuration, and a further field-tested study, the configuration of compressors. Central to our approach is the use of the proof planning technique, and the clean separation of different kinds of knowledge: factual, heuristic, and strategic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Planning and Industrial Configuration

The problem of configuration is a complex industrial issue. It has been shown in the past that considerable amounts of labour were spent on problems connected with manufacturing based decisions. Planning and scheduling, design and configuration, logistics and resource management are representative examples. In the case where the complexity of products to be manufactured is getting more flexible...

متن کامل

User Interface for Adaptive Suggestions for Interactive Proof

We describe an interaction console for interactive proof exercises using proof planning as back-engine. Based on the proof planning situation, the console offers suggestions for proof steps. These suggestions can dynamically be adapted, e.g. to the user and to pedagogical criteria. This adaptive configuration is possible because the suggestion mechanism and proof planning are clearly separated....

متن کامل

Proof Planning & Configuration

This paper presents two configuration problems: that of configuring computer hardware to meet a given specification, and an “engineer-and-made-to-order” problem in the domain of breathing air compressor production. We demonstrate how the different kinds of knowledge needed to solve problems in each domain (which we label factual, heuristic, and strategic) was captured for a proof planning syste...

متن کامل

Graph-based optimal reconfiguration planning for self-reconfigurable robots

The goal of optimal reconfiguration planning (ORP) is to find a shortest reconfiguration sequence to transform a modular and reconfigurable robot from an arbitrary configuration into another. This paper investigates this challenging problem for chain-typed robots based on graph representations and presents a series of theoretical results: (1) A formal proof that this is a NP-complete problem, (...

متن کامل

Tailorable language for behavioral composition and configuration of software components

Many software systems suffer from missing support for behavioral (runtime) composition and configuration of software components. The concern “behavioral composition and configuration” is not treated as a first-class entity, but instead it is hard-coded in different programming styles, leading to tangled composition and configuration code that is hard to understand and maintain. We propose to em...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • AI EDAM

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1998